The vehicle routing problem with heterogeneous locker boxes

Abstract To achieve logistic efficiency and customer convenience in last-mile delivery processes, a system with alternative points the form of locker box stations can be used. In such system, customers served either at their home address within certain time window, or station where parcels picked up any time. Customers get compensation payment when being box. They have request more than one parcel different sizes. At station, limited number slots sizes is available; we assume that stored together slot. We consider vehicle routing problem heterogeneous boxes, total cost—consisting costs—has to minimized while taking into account packing boxes. provide mathematical formulation propose metaheuristic solution method. Instances results from literature for single slot size are used benchmark our For sizes, compare unit-size model multi-size model, considered latter. Finally, analyze how configurations work demand scenarios.